package com.yun.algorithmproblem.leetcode;

public class Leetcode598 {

    public int maxCount(int m, int n, int[][] ops) {
        int row=Integer.MAX_VALUE,col=Integer.MAX_VALUE;
        for (int[] op : ops) {
            row=Math.min(row,op[0]);
            col=Math.min(col,op[1]);
        }
        return Math.min(row,m)*Math.min(col,n);
    }
}
